Method for the mapping of colour values of a colour image in the colour values of a highlight-colour image and corresponding print system

ABSTRACT

The invention relates to a mapping method, whereby colour values of the colour image to be mapped, represented in the RGB colour space are mapped in the highlight-colour colour space, corresponding to a projection of the colour values in highlight-colour. The corresponding calculations are carried out in the RGB colour space. A transformation into another colour space is not necessary. Furthermore, various corrections are provided, such that a highlight colour image is created which is as natural as possible for the human eye.

[0001] The invention is directed to a method for mapping color values of a color image onto the color values of a highlight color image (HC image). In particular, the invention is directed to a method wherein the color values of the color image are represented as vectors of the RGB color space, and the color values of the highlight color image only comprise vectors of a highlight color color space that covers the region in the RGB color space between all gray scale levels and a highlight color color.

[0002] U.S. Pat. No. 5,237,517 discloses a method for mapping color values of a color image onto the color values of a highlight color image that covers only color values of a highlight color color space. Such a highlight color color space comprises all color values in the region between the gray scale levels and a predetermined highlight color color. This method is also disclosed in “Principles for Mapping from Full Color to Highlight Color”, Steven J. Harrington, in IS&T's Eighth International Congress on Advances in Non-Impact Printing technologies, 1992, pages 458 ff.

[0003] In this method, the color values of the color image, which are usually represented as RGB color values, are subjected to a coordinate transformation into YES color values. This is a specific color system wherein the fully saturated color values are arranged in a plane. The YES coordinate system comprises three coordinates Y, E, S, whereby Y is the brightness of the color value and E and S are respective color values that erect a color plane. When mapping the color values of the color image onto the highlight color color space, the respective color values are first projected into the color plane. The color value of the highlight color color is also projected into the color plane, whereby the projected color value of the color value to be mapped is projected anew onto this projected color value. This projection ensues by means of a calculation of the cosine between the two projected color values, whereby this value is raised to the power of three. This exponentiation of the cosine value is expedient since the individual, fully saturated colors (red, yellow, green, cyan, blue, magenta) describe an angle of 60° in the color plane with the respectively adjacent color, so that the mapping without the power of three would map half the amount onto two neighboring primary colors since the cosine of 60° is equal to ½. The mapping of such a large amount of a primary color onto another primary color, however, is undesired since this has an unnatural effect. Due to the exponentiation with three, the amount of the mapping is reduced to ⅛ in the mapping for the angle of 60°. It is also advantageous that the operational sign is retained in the exponentiation with three.

[0004] The color values mapped in this way onto the highlight color space serve the purpose of driving the HC color of a printer or color picture screen. Since a color picture screen is usually driven with RGB color values, the mapped color values must be subjected to another coordinate transformation into the RGB color space.

[0005] The invention is based on the object of creating a simple method for mapping color values of a color image onto a highlight color color space.

[0006] This object is achieved by a method having the feature of claim 1. Advantageous developments are recited in the subclaims.

[0007] In the inventive method for mapping color values of a color image, the colo5rs values are represented as vectors of the RGB color space. The highlight color color space comprises all color values that cover the region in the RGB color space between all gray scale levels and a highlight color color. A color value in the RGB color space is allocated to each picture element of the color image, and a highlight color color is prescribed by a color vector in the RGB color space.

[0008] The inventive method is characterized in that a color part F_(HC) of the highlight color color C_(HC) is determined by vector subtraction of a black part from the color value C_(HC), a color part F_(in) of a color value C_(in) to be mapped is determined by vector subtraction of a black part from the color value C_(in), the color values of the color image are mapped onto a color value C′_(Gamut) of the highlight color color space by determining a mapping factor p′ by means of calculating the cosine between the color parts and a multiplication of the mapping factor p′ by a unit vector E_(HC) that is directed in the direction of the highlight color color, and the amount of the color part F_(in) of the color value C_(in) to be mapped.

[0009] With the inventive method, thus, the color values of a color image are mapped onto a highlight color color space without needing a coordinate transformation. The individual calculations ensue with color values represented in the RGB color space. As a result thereof, rounding errors due to the additional coordinate transformation are avoided, and the mapping method, due to the elimination of the coordinate transformation, can be implemented faster than the traditional method.

[0010] Moreover, the inventive method is independent of the selection of the color of the highlight color, i.e. it can be applied to any arbitrary highlight color color without having to modify the nature of the calculation in any way whatsoever.

[0011] Preferably, corrections are implemented in the mapping by taking the black part of the color value to be mapped into consideration and/or by taking a color correction value into consideration.

[0012] With the inventive method, the color values of a color image are mapped onto the highlight color color space, so that a complete description of the original color image in the highlight color color space is available. Using a color image mapped in this way, half-tone separations can then be derived in a known way for driving a printer or a color picture screen or the like, as disclosed in greater detail in U.S. Pat. No. 5,237,517, which is a constituent part of the disclosure of this application.

[0013] The above-described method produces a map of the color values of a color image onto the highlight color color space that is optimally true-to-life for the human eye. It is especially suited for editing chromatic image data for presentation on a two-color display medium, for example in a printing process for printing a recording medium with two colors. A further embodiment of the invention creates a mapping method with which color images such as, for example, commercial graphics or other artificially designed images whose colors are not prescribed by an optimally true-to-life reproduction are mapped onto a highlight color color space, whereby the mapping here optimally ensues such that the individual colors can be distinguished from one another optimally well in the highlight color color image. To this end, a mapping table having color values uniformly distributed in the highlight color color space is generated, and, using a hash function, the color values of the color image are allocated to the color values of the mapping table. Discrete color values that have a uniform, predetermined distance from one another in the color space are thus provided in the highlight color color space. This assures that the individual color values of the highlight color image can be distinguished well from one another.

[0014] Preferably, the above-described mapping with the projection of the color values to be mapped onto the color of the highlight color in the RGB color space is employed as hash function.

[0015] In another preferred development of this method, the frequencies of occurrence of the individual color values in the color image to be mapped are determined, and the color values are allocated to the mapping table in the sequence of their frequency of occurrence. This assures that color values that occur often in the color image to be mapped have a color value in the highlight color color space allocated to them with priority, so that there is a high probability that color values that are clearly distinguished from one another in the color image to be mapped are also clearly distinguished from one another in the mapped highlight color image.

[0016] The invention is explained in greater detail below by way of example with reference to the attached drawings. Shown therein are:

[0017]FIG. 1 a cube for representing the RGB color space with the colors w=white, k=black, r=red, g=green, b=blue, c=cyan, m=magenta and y=yellow;

[0018]FIGS. 2a through 2 c a mapping table, shown schematically;

[0019]FIG. 3 the distribution of color values in a highlight color color space; and

[0020]FIG. 4 a printing system.

[0021] In an inventive method for mapping color values of a color image, the color values of the color image are represented as vectors of the RGB color space. In the present description of the invention, vectors are represented by upper case letters and scalars are represented by lower case letters. The color black is represented by the vector (0, 0, 0) and the color white is represented by the vector (255, 255, 255). The color values of the color image to be mapped are respectively represented by a vector C_(in) with (r_(in), g_(in), b_(in)).

[0022] The following notations known from vector mathematics are employed in the description of the invention. Two color values C₁, C₂ are multiplied by one another with the scalar or vector product according to the following equation:

C ₁ •C ₂ :=r ₁ ·r ₂ +g ₁ ·g ₂ +b ₁ ·b ₂

[0023] The norm of a vector is calculated according to the following equation:

|C ₁ |:={square root}{square root over (r₁ ²+g₁ ²+b₁ ²)}.

[0024] U.S. Pat. No. 5,319,473 and U.S. Pat. No. 5,237,517 can also be useful for understanding the invention, their contents being herewith incorporated by reference into the present specification.

[0025]FIG. 1 shows the RGB space by means of a cube, whereby the corners of the cube have the colors k=black, y=yellow, r=red, m=magenta, w=white, b=blue, c=cyan and g=green allocated to them. The diagonal line GL from black to white covers all gray scale values of the RGB color space. This diagonal is therefore referred to below as gray lines GL. The unit vector pointing from black to white along the gray line GL is of significance for the following explanations of the invention, this being represented in the following way:

E _(Diag):=(1/{square root}{square root over (3;)}1/{square root}{square root over (3;1)}/{square root}{square root over (3)})

[0026] The black part k_(in) of the color value Cin is defined in the following way:

k _(in) =E _(Diag) •C _(in)=(r _(in) +g _(in) +b _(in))/{square root}{square root over (3)}

[0027] Since, given the present exemplary embodiment, black is represented by ( 0, 0, 0) and white is represented by (255, 255, 255), the black part k_(in) has a value range from 0 through 255, whereby 0 represents the maximum and 255 represent the minimum black part.

[0028] The black part vector K_(in) of the color C_(in) is, consequently, as follows:

k _(in) =k _(in) ·E _(Diag)

[0029] Consequently, a color part vector can also be calculated from the color value according to the following equation:

F _(in) =C _(in) −k _(in) ·E _(Diag)

[0030] In a corresponding way, the color part vector of the highlight color color can also be represented:

F _(HC) =C _(HC) −k _(HC) ·E _(Diag)

[0031] In FIG. 1, the color part vector F_(HC) of the highlight color red is entered with C_(HC)=(255, 0, 0). The color part vector is orthogonal to the gray line GL. The analogous applies to the color part vector F_(in) of an arbitrary color value.

[0032] Since the color part vectors are orthogonal to the gray line, they lie in the plane that is orthogonal to the gray line and that can be referred to as color plane since the vectors contained therein are independent of the gray part. A mapping onto the highlight color color can be implemented in this color plane, this being described in greater detail below, even though a coordinate transformation is not needed for this purpose, as is applied given the initially described method (transformation into YES).

[0033] A mapping factor P′ is calculated according to the following equation from the color part vectors F_(in) of a color value to be mapped and the highlight color:

p′(C _(HC) ,C _(in))=cos³(F _(HC) ,F _(in)),

[0034] when cos(F _(HC) , F _(in))>0, otherwise p′(C _(HC) , C _(in))=0applies.

[0035] The cosine function between two vectors in the Euclidean vector space is defined by the following vector product: ${\cos \left( {F_{HC},F_{i\quad n}} \right)} = \frac{F_{HC} \cdot F_{i\quad n}}{{F_{HC}} \cdot {F_{i\quad n}}}$

[0036] Using the mapping factor p′, the color part vector F_(in) mapped onto the color part vector F_(HC) of the highlight color color is calculated in the following way:

C″ _(Gamut) =|F _(in) |p′(C _(HC) ,C _(in))·F _(HC) /|F _(HC)|

[0037] In this equation, F_(HC)/|F_(HC)| represents the unit vector E_(HC) that is directed in the direction of the color of the highlight color. The map vector C″_(Gamut) thus has the direction of the highlight color in the RGB color space with the amount of the color part vector F_(in) of the color value to be mapped, this being multiplied by the mapping p′.

[0038] The black part of the color value to be mapped has not yet been taken into consideration in this mapping. The above mapping vector can therefore be supplemented in the following way:

C′ _(Gamut) =|F _(in) |p′(C _(HC) ,C _(in))·F _(HC) /|F _(HC) |+k _(in) E _(Diag)

[0039] With this correction, the black part is trans space of the highlight color, since it should also be presented in the highlight color image unmodified compared to the initial image.

[0040] With the above mapping, thus, the original black part is transferred unmodified and the original color part is mapped onto the color of the highlight color. In the calculation of C″_(Gamut), the color parts of F_(in) are eliminated, these being either opposite or orthogonal to the color part vector F_(HC) of the color of the highlight color. The eliminated color part can be represented by C″_(Gamut)−F_(in) or, respectively C″_(Gamut)−C_(in). The physiological color effect C′_(Gamut) −C_(in) is dependent on the respective color. For example, green is brighter then blue. This can be taken into consideration by means of a color culture vector K_(kor) according to the following equation:

C _(Gamut) =C′ _(Gamut)+((C′ _(Gamut) −C _(in) •K _(kor))E _(Diag)

[0041] The color correction vector has the following values (−0.12; −0.27; −0.03).

[0042] The above mapping allocates exactly one color value of the highlight color color space to each color value of a color image. Highlight color images that are very true-to-life for the human eye can be produced with this mapping. A color picture screen can be directly driven with the mapped color value C_(Gamut) since this color value is a color value of RGB color space.

[0043] A highlight color color image is printed in the highlight color color and a standard color, usually black. A printer printing a highlight color image usually comprises a toner in the color black and a toner in another color, for example in red, blue or white. For printing the highlight color image, it is necessary that half-tone separations be generated for printing the color black and for printing the highlight color color. For driving the half-tone separations, the color saturation values for the color black K_(OUT) and for the highlight color color HC_(OUT) must be determined for each picture element of the highlight color image.

[0044] The color saturation of the color black can, for example, be determined in a simple way with the following equation:

K _(OUT)=max(r _(Gamut) ,b _(Gamut) ,g _(G)amut)

[0045] The maximum value of the three components of the mapped color value C_(Gamut) is thereby selected, since this represents the projection of the mapped color value C_(Gamut) onto the gray line GL.

[0046] The color saturation of the highlight color color to be printed is calculated according to the following equation: ${HC}_{1} = {\frac{F_{HC} \cdot F_{Gamut}}{{F_{HC}}^{2}} \cdot 255}$

[0047] Since the black toner covers the highlight color color, the color part must be boosted given dark colors, the following correction is inserted for this purpose:

K ₁=(255−K _(OUT)/255

[0048] ${HC}_{OUT} = \frac{{HC}_{1} \cdot 1.05}{1.05 - K_{1}}$

[0049] The color blank and the highlight color color can be driven at a printer with the values K_(OUT) and HC_(OUT) . For representing the different color saturation levels, the color separations described with the color saturation values are dithered with known methods.

[0050] When mapping the color values of a color image onto the highlight color color space, it is not all is necessary that an optimally true-to-life map be generated; rather, it is sometimes even desirable that, instead of a true-to-life map, the colors employed in the color image are represented such in the highlight color image that they can be clearly be distinguished from one another. Such a map is particularly desired given commercial graphics wherein, for example, individual managerial events are presented with different colors. It is thereby significant that the individual managerial events can in turn be clearly distinguished from one another given a mapping into the highlight color space.

[0051] Given a mapping of a color image representing a subject that is not true-to-life onto the highlight color color space or some other mode of presentation, thus, the different colors of the color image should be optimally clearly distinguished from one another in the mapped image. Further, it is expedient that the colors black and white of the color image are in turn mapped onto black and white in the mapped image.

[0052] To this end, the color image to be mapped is first analyzed. In the analysis of the color image, the color values C_(in)-_(i) contained in the color image are determined and their plurality l and their frequency of occurrence are identified. These color values are entered into a table having two columns (FIG. 2a), being entered into the left-hand column.

[0053] In the following processing step, the individual color values are sorted, whereby the color values for the color white and the color black are initially placed at the first two locations in the column. The other color values are sorted according to their frequency of occurrence (FIG. 2a→FIG. 2b).

[0054] The color values C_(HC-i) to be mapped or, respectively, the corresponding modes of representation are to be entered in the right-hand column of the table from FIGS. 2a through 2 c. In a mapping onto the highlight color color space, the color values C_(HC-i) of the highlight color color space are arranged uniformly distributed in this raster which, for example, is lozenge-shaped.

[0055]FIG. 3 shows the highlight color color space for a highlight color HC. This color space is represented by a triangle whose one side edge is the gray line GL of the RGB color space of FIG. 1. The gray line extends between the colors black and white that respectively form a corner of the triangle. The third corner of the triangle is formed by the highlight color color HC. The area of triangle represents the area in the cube of FIG. 1 between the gray line GL and the color values HC of the highlight color color. The highlight color color values C_(HC-l) through C_(HC-m) onto which a color value of the color image can be mapped are arranged in a grit having lozenge-shaped grid cells in the exemplary embodiment shown in FIG. 3., whereby each corner of a grid cell represents such a highlight color mapping color value C_(HC-i) This grid is constructed, for example, such that n highlight color mapping color values C_(HC-i) are arranged at every side edge of the triangle distributed equally spaced over the respective side edge, whereby a highlight color mapping color value is allocated to each corner point of the triangle. The Lozenge-shaped grid is erected by means of correspondingly regularly spaced color values between these highlight color mapping color values C_(hc-i) arranged on the edges of the triangle. m=(n+1)·n/2 highlight color mapping color values thereby derive. The plurality of highlight color mapping color values is to be selected such that the individual highlight color mapping color values are, on the one hand, spaced far from one another in order to be able to be clearly distinguished from one another by the human eye and, on the other hand, such that an adequate plurality are present in order to be able to map the color values present in the color image to be mapped as completely as possibly thereon. For n=22, for example, 253 highlight color mapping color values derive. This is a plurality of color values that is adequate for most purposes. The value n therefore preferably lies in the range from 3 through 25. Higher values of n are not expedient since the distinguishability of the individual colors is lost as a result thereof.

[0056] Instead of a lozenge-shaped grid, for example, a grid having triangular cells can also be provided. Given such a grid, the plurality m of all highlight color mapping color values must be determined with an equation other then the above-recited equation (m=(n+1)n/2).

[0057] Based on the criterion of the plurality l of color values C_(HC-i) of the color image to be mapped, the plurality m of the highlight color mapping color values C_(HC-i) is defined, whereby the smallest n is selected for which m is greater than or equal to 1. The following thus applies:

m(n)≧1

[0058] The individual color values of the color image to be mapped are now to be allocated to these highlight color mapping color values. First, the corresponding color value C_(HC-l) of the color white is allocated to the color value C_(in-l) of the color white. The corresponding case is carried out in the second row of the table for the color black.

[0059] The further allocation ensues by means of a hash function f_(HASH). To this end, for example, the above-explained mapping onto C_(Gamut) is employed, f_(HASH) (C_(in))=C_(Gamut). A color value C_(in-i) to be mapped is thus initially mapped onto C_(Gamut-i). That value of the highlight color mapping color values C_(HC-i) that is still free and closest to C_(Gamut-i) is then determined and this highlight color mapping color value is allocated to the original color value C_(in-i), i.e. these two values are written into the same row in the table of FIG. 2c. When the closest highlight color mapping value has already been assigned, then the next free highlight color mapping color value must be selected. In that the color values C_(in-i) that occur most frequently are allocated first, these are allocated with prioritization, this assuring that these have a highlight color mapping color value allocated to them that corresponds optimally well to the corresponding C_(Gamut-i). As a result thereof, a map of the color image that is optimally similar for the human eye is produced in addition to the optimally good distinguishability of the individual colors of the highlight color image.

[0060] If the plurality of color values C_(in-i) of the color image to be mapped is greater then the maximum plurality (m(n_(max))) of the highlight color mapping color values C_(HC-i), then all color values C_(in-i) cannot be mapped.

[0061] A possible solution of this problem is comprised in not allocating the color values C_(in-i) having a frequency of occurrence less then 0.05% through 0.5%.

[0062] Another possibility is that, for example, the list with the frequency of occurrences of the individual color values C_(in-i) is cut off as soon as at least 99.55 of the area of the image has been covered.

[0063] If the two above-recited possibilities for reducing the plurality of color values to be mapped do not suffice, then the individual color values C_(in-i) with the hexadecimal number F8F8F8 can be masked, as a result whereof the plurality of color values is clearly reduced. The color image must be re-analyzed after the marking of the individual color values. A certain imprecision is produced as a result of the marking but this is often of no consequence given commercial graphics. It must be thereby be taken into consideration that such graphics usually have only a low number of colors, whereby, however, color values deviating therefrom can occur at boundary locations, for example due to a bleeding of the color and, in particular when scanning. The above masking then represents an insignificant information loss since only this color bleeding at the boundaries of neighboring color fields is omitted. After the masking, the frequencies of occurrence of the individual colors must be redetermined and the allocation to the highlight color mapping color values must ensue.

[0064] Once the mapping table has been compiled, then the color values of a color image can be mapped onto a highlight color color space merely by selecting the corresponding highlight color mapping color values. This can be very quickly implemented and leads to a highlight color image wherein the individual colors of the original color image can be clearly distinguished from one another.

[0065] The mapping of color images representing subjects that are not true-to-life has been described above with reference to a mapping onto the highlight color color space. Within the framework of the invention, it is also possible that the color values of the color image are image dotted different filling patterns with such a map, these representing corresponding colors of the color image in the mapped image. For example, it is also possible with such a mapping to distinguishably represent the different chromatic regions of a color image in a black-and-white image. Given such a modification, the corresponding filling patterns are merely inserted in the table from FIG. 2c in the right-hand column thereof instead of the highlight color mapping color values.

[0066] Dependent on the demands, some other allocation of the highlight color mapping color values to the color values of the color image can also ensue, whereby, for example, certain freely selectable color values of the color image are to be handled with priority. With respect thereto, the aforementioned hash function can also be modified in that, for example, specific company colors are always allocated to the same highlight color colors. For example, it can also be expedient to respectively employ the same hash function or even the same table for the allocation of different color images of an image sequence, even though different color values are contained in the individual color images that, given the above-described allocation via the frequency of occurrence, would yield different allocations of the individual color values of the color image to different highlight color mapping color values.

[0067]FIG. 4 shows a printing system wherein chromatic image data referred to a full color space (RGB) are generated in a user software program 11 running on a user computer 10. The image data generated in this way can then be converted onto the HLC color space with the inventive, above-described method by means of a transformation software program 12 or, respectively, by means of a corresponding electronic circuit (hardware) in the user computer 10. Subsequently, the data edited in this way are transmitted to a print server 13 to which a printer device 14 is in turn connected. Further computers can be connected to the print server 13 via the terminal 15, the print server 13 also being capable of receiving RGB image data or other full color image data such as yellow, magenta-cyan-black (YMCK) image data from these that are not optimized to the HLC color space. The corresponding conversion of such full color image data onto HLC image data can then ensue via the transformation software program 12 a installed in the print server 13, this functioning exactly like the transformation program 12.

[0068] Two printing stations 16 and 17 that can each respectively print in two different colors are located in the printer device 14. To that end, for example, the electrophotographic printer unit 16 comprises a developer station 16 a containing black toner and the printing unit 17 comprises a developer station 17 a containing red toner. Moreover, each of the printing units 16, 17 contains known electrophotographic components such as a photoconductor drum, corotron devices, and an exposure unit such as, for example, a light-emitting diode comb. The data received by the print server are thereby received by a scalable raster architecture (SRA) print data controller 18 contained in the printer device 14, are respectively rastered into individual picture elements and are supplied true-to-color to the two printing units 16, 17 or, respectively, the corresponding light-emitting diode combs 16 b, 17 b for forming a latent image on the corresponding photoconductor drum. The electrostatic images that have arisen in this way are then developed with toner electrophotographically in known way and are transfer-printed such onto the recording medium, here an individual paper sheet 19, that the desired HLC image arises on the paper sheet 19.

[0069] The above-described mapping methods for optimally true-to-like mapping onto the highlight color color space as well as the method for mapping images that represent objects that are not true-to-nature can be implemented off-line. Particularly given the latter method, a mapping table can be generated off-line, this being capable of being applied repeatedly and fast to different color images of an image sequence and allowing a very fast conversion into a different presentation mode.

[0070] The invention can be realized both as a computer program as well as a computer program product or can be integrated in a computer and, in particular, in printing systems having connected print servers. It can thereby run on a server, on a client PC, in a printer device, particularly within the above-described SRA controller and/or on a computer integrated into a data network in [ . . . ] other [ . . . ]. Corresponding program data files can be stored on a data carrier or can be disseminated via LAN and WAN networks such as the Internet. The invention can be summarized in brief in the following way:

[0071] The invention is directed to a method for mapping color values of a color image onto a highlight color color space.

[0072] In the inventive mapping method, the color values of the color image to be mapped that are represented in the RGB color space are mapped with a mapping step onto the highlight color color space that corresponds to a projection of the color values onto the highlight color. The corresponding calculations ensue in the RGB color space. A conversion into a different color space is not necessary. Moreover, various corrections are provided, so that a highlight color image that is as true-to-life as possible for the human eye is produced. 

1. Method for mapping color values of a color image that are represented as vectors of the RGB color space onto the color values of a highlight color image (HC image) that only comprise vectors in the highlight color color space that covers the region in the RGB color space between all gray scale values and a highlight color color, whereby a color value (C_(in)=(r, g, b) in the RGB color space is allocated to each picture element of the color image and a highlight color color (C_(HC)) is prescribed by a color vector in the RGB color space, whereby a color part (F_(HC)) of the highlight color color (C_(HC)) is determined by vector subtraction of a black part from the color value (C_(HC)), a color part F_(in) of a color value (C_(in)) to be mapped is determined by vector subtraction of a black part from the color value (C_(in)), the color values of the color image are mapped onto a color value (C″_(Gamut)) of the highlight color color space by determining a mapping factor (p′) by means of calculating the cosine between the color parts and a multiplication of the mapping factor (p′) by a unit vector (E_(HC)) that is directed in the direction of the highlight color color, and the amount of the color part (F_(in)) of the color value (C_(in)) to be mapped.
 2. Method according to claim 1, characterized in that the mapping factor (p′) is exponentiated with
 3. 3. Method according to claim 1 or 2, characterized in that the black part (k_(in)) of the color value (C_(in)) to be mapped is multiplied by a unit vector (E_(Diag)) that is directed in the direction of a line in the RGB space describing the gray levels, and this product is added to the mapped color value (C″_(Gamut)).
 4. Method according to claim 3, characterized in that a color correction value is calculated in that the vector difference between the mapped color value (C′_(Gamut)) and the color value (C_(in)) to be mapped is multiplied by a color correction vector and the product resulting therefrom is multiplied by the unit vector (E_(Diag)) that is directed in the direction of the line in the RGB color space describing the gray levels, and the color correction value deriving therefrom is added to the mapped color value (C′_(Gamut)) for the presentation of the mapped and corrected color value (C_(Gamut)).
 5. Method according to claim 4, characterized in that the color correction vector is represented by the vector (−0.12; −0.27; −0.03).
 6. Method according to claim 4 or 5, characterized in that a half-tone separation for the highlight color color and a half-tone separation for a standard color are derived from the mapped and corrected color value (C_(Gamut)).
 7. Method for mapping color values of a color image that are represented as vectors of the RGB color space onto different presentation elements such as, for example, color values of a highlight color color space or different patterns, whereby the color values (C_(in-i)) are determined; the frequency of occurrence of the individual color values (C_(in-i)) is identified; the color values of the color image are sorted according to the frequency of occurrence; and a mapping table is produced wherein the sorted color values (C_(in-i)) are respectively allocated to a presentation element (C_(HC-i)) in the sorted sequence.
 8. Method according to claim 7, characterized in that the color values of the color image are mapped onto the highlight color color space and [ . . . ] color value ((C_(HC-i)) uniformly distributed in the highlight color space [ . . . ] identified and allocated to the color values (C_(in-i)) of the color image by means of a hash function.
 9. Method according to claim 8, characterized in that the mapping (C_(Gamut)) according to one of the claims 1 through 6 is employed as hash function, whereby the color value in the highlight color color space determined by means of the hash function is allocated to the next free color value of the mapping table.
 10. Method according to one of the claims 7 through 9, characterized in that the color values (C_(in-i)) of the color image whose frequency of occurrence is lower than a predetermined value are not accepted into the mapping table.
 11. Method according to one of the claims 7 through 10, characterized in that the color values (C_(in-i)) of the color image are masked with the hexadecimal number F8F8F8 at least before the allocation to the color values of the highlight color color space.
 12. Printing system having an apparatus (18) for the implementation of a method according to one of the claims 1 through
 11. 13. Computer program product that, when run on a computer (10, 13) effects a method execution according to one of the claims 1 through
 11. 